The authors discussed the procedure of building a sequential coded quardtree , explain how to add points clouds to nodes of tree 阐述了顺序四叉树的快速建立,并通过一个试验系统验证了文中所提方法的有效性。
When splitting nodes of tree , gini index is chosen as a splitting criterion and caim measure is used to transform continuous attributes into discrete ones 分裂指标采用了giniindex计算方法,确定分裂点时使用了caim算法对连续型属性进行了离散化处理。